Stochastic scheduling with minimizing the number of tardy jobs using chance constrained programming

Minimizing the Number of Tardy Jobs

Minimizing the Number of Tardy Jobs with Chance Constraints and Linearly Associated Stochastically Ordered Processing Times

We consider the single-machine sequencing model with stochastic processing times and the problem of minimizing the number of stochastically tardy jobs. In general, this problem is NP-hard. Recently, however, van den Akker and Hoogeveen found some special cases that could be solved in polynomial time. We generalize their findings by providing a polynomial solution for any stochastically ordered ...

Minimizing the number of tardy jobs in single machine scheduling using MIP

This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how both good-quality lower and up...

Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints

In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries

In this paper, an integrated due date assignment, and delivery scheduling of order for multi customer for make to order production system in supply chain has been survered. One manufacture received n orders from K customers. The due date of orders for each customer is common and manufacture can assign the due dates with a related cost. Orders must be process by one machine and send to customers...